Optimization algorithms for resilient path selection in networks
نویسندگان
چکیده
منابع مشابه
ALGORITHMS FOR BIOBJECTIVE SHORTEST PATH PROBLEMS IN FUZZY NETWORKS
We consider biobjective shortest path problems in networks with fuzzy arc lengths. Considering the available studies for single objective shortest path problems in fuzzy networks, using a distance function for comparison of fuzzy numbers, we propose three approaches for solving the biobjective prob- lems. The rst and second approaches are extensions of the labeling method to solve the sing...
متن کاملalgorithms for biobjective shortest path problems in fuzzy networks
we consider biobjective shortest path problems in networks with fuzzy arc lengths. considering the available studies for single objective shortest path problems in fuzzy networks, using a distance function for comparison of fuzzy numbers, we propose three approaches for solving the biobjective prob- lems. the rst and second approaches are extensions of the labeling method to solve the sing...
متن کاملResilient Optical Networks Design using Particle Swarm Optimization Algorithms
Dropping of Information Communication Technology (ICT) based applications and facilities due to cable cuts failures in optical backbones leads to loss of many resources and opportunities. Therefore, resilience is an important issue toward reliable next generation networks which is a complicated designing issue and known to be an NP-hard problem. This paper presents an intelligent particle swarm...
متن کاملPath Selection Algorithms in Mobile Ad Hoc Networks
The connectivity richness in mobile ad hoc networks, there are paths between a source and a destination. There are many applications those require uninterrupted connections between the nodes while transferring the packets, the long-living paths can be very useful to provide Quality of Service. In this paper, we propose path-selection algorithms and evaluate their performance in a mobile ad hoc ...
متن کاملGenetic Algorithms for RDF Query Path Optimization
In this paper we present an approach based on genetic algorithms for determining optimal RDF query paths. The performance of this approach is benchmarked against the performance of a two-phase optimization algorithm. For more complex queries, the genetic algorithm RDFGA generally outperforms two-phase optimization in solution quality, execution time needed, and consistency in performance. Setti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Operations Research
سال: 2021
ISSN: 0305-0548
DOI: 10.1016/j.cor.2020.105191